The Tight Lower Bound for the Steiner Ratio in
نویسندگان
چکیده
A minimum Steiner tree for a given set X of points is a network interconnecting the points of X having minimum possible total length. The Steiner ratio for a metric space is the largest lower bound for the ratio of lengths between a minimum Steiner tree and a minimum spanning tree on the same set of points in the ,metric space. In this note, we show that for any Minkowski plane, the Steiner ratio is at least 2/3. This settles a conjecture of D. Cieslik, and also Du et al,,
منابع مشابه
A Note on Online Steiner Tree Problems
We introduce and study a new Steiner tree problem variation called the bursty Steiner tree problem where new nodes arrive into bursts. This is an online problem which becomes the well-known online Steiner tree problem if the number of nodes in each burst is exactly one and becomes the classical Steiner tree problem if all the nodes that need to be connected appear in a single burst. In undirect...
متن کاملA bound for Feichtinger conjecture
In this paper, using the discrete Fourier transform in the finite-dimensional Hilbert space C^n, a class of nonRieszable equal norm tight frames is introduced and using this class, a bound for Fiechtinger Conjecture is presented. By the Fiechtinger Conjecture that has been proved recently, for given A,C>0 there exists a universal constant delta>0 independent of $n$ such that every C-equal...
متن کاملOptimal Competitiveness for the Rectilinear Steiner Arborescence Problem
We present optimal online algorithms for two related known problems involving Steiner Arborescence, improving both the lower and the upper bounds. One of them is the well studied continuous problem of the Rectilinear Steiner Arborescence (RSA). We improve the lower bound and the upper bound on the competitive ratio for RSA from O(logN) and Ω( √ logN) to Θ( logN log logN ), where N is the number...
متن کاملPrimal-dual approaches to the Steiner problem
. We study several old and new algerithms for computing lower and upper bounds for the Steiner problem in networks using dual-ascent and primal-dual strategies. These strategies have been proven to be very useful. for the algorithmic treatment of the Steiner problem. We show that none of the known algorithms can both generate tight lower bounds empirically and guarantee their quality theoretica...
متن کاملA Faster Approximate Minimum Steiner Tree Algorithm & Primal-Dual and Local-Ratio Greedy Algorithms
We prove matching upper and lower bounds for the Minimum Steiner Tree (MStT) problem within the adaptive priority stack model introduced by Borodin, Cashman, and Magen [2] and lower bounds within the adaptive priority queue model introduced here. These models, which are extensions of the adaptive priority model of Borodin, Nielson, and Rackoff [3], are said to capture reasonable primal-dual and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995